Online Ramsey games for more than two colors
نویسندگان
چکیده
منابع مشابه
Balanced Online Ramsey Games in Random Graphs
Consider the following one-player game. Starting with the empty graph on n vertices, in every step r new edges are drawn uniformly at random and inserted into the current graph. These edges have to be colored immediately with r available colors, subject to the restriction that each color is used for exactly one of these edges. The player’s goal is to avoid creating a monochromatic copy of some ...
متن کاملOnline Ramsey Games in Random Graphs
Consider the following one-player game on a graph with n vertices. The edges are presented one by one to the player in a random order. One of r available colors has to be assigned to each edge immediately. The player’s objective is to color as many edges as possible without creating a monochromatic copy of some fixed graph F . We prove a lower bound of n on the typical duration of this game, wh...
متن کاملOn Communication Games with More than Two Players
Electronic copies of technical reports are available: Via FTP: Host ftp.informatik.uni-trier.de, directory /pub/reports Via gopher: Host gopher.informatik.uni-trier.de, port 70, type 1, pathes 1/TechReports/Abstracts and 1/TechReports/FullText Via WWW: URL http://www.informatik.uni-trier.de/Reports/List Via email: Send a mail to [email protected], subject ’MAIL ME CLEAR’, body...
متن کاملLearning in games with more than two players
We address the problem of learning in repeated N-player (as opposed to 2-player) general-sum games. We describe an extension to existing criteria focusing explicitly on such settings. While there have been several criteria proposed recently for evaluating learning algorithms in multi-agent systems, most of this work has focused on the two-player setting. Relatively little work has addressed sit...
متن کاملOnline Ramsey games for triangles in random graphs
In the online F -avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as it appears; his goal is to avoid a monochromatic copy of F . Let N0(F, r, n) be the threshold function for the number of edges that the player is asymptotically almost surely able to paint before he loses. Even when F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2016
ISSN: 1042-9832
DOI: 10.1002/rsa.20698